The generating function of planar Eulerian orientations
نویسندگان
چکیده
منابع مشابه
On the number of planar Eulerian orientations
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count families of subsets and supersets of planar Eulerian orientations, indexed by an integer k, that converge to the set of all planar Eulerian orientations as k incre...
متن کاملReliable Orientations of Eulerian Graphs
We present a characterization of Eulerian graphs that have a k-arc-connected orientation so that the deletion of any vertex results in a (k− 1)-arc-connected directed graph. This provides an affirmative answer for a conjecture of Frank [2]. The special case, when k = 2, describes Eulerian graphs admitting 2-vertexconnected orientations. This case was proved earlier by Berg and Jordán [1]. These...
متن کاملCounting the Number of Eulerian Orientations
Consider an undirected Eulerian graph, a graph in which each vertex has even degree. An Eulerian orientation of the graph is an orientation of its edges such that for each vertex v, the number of incoming edges of v equals to outgoing edges of v, i.e. din(v) = dout(v). Let P0 denote the set of all Eulerian orientations of graph G. In this paper, we are concerned with the questions of sampling u...
متن کاملTwo-connected orientations of Eulerian graphs
A graph G = (V,E) is said to be weakly four-connected if G is 4-edgeconnected and G− x is 2-edge-connected for every x ∈ V . We prove that every weakly four-connected Eulerian graph has a 2-connected Eulerian orientation. This verifies a special case of a conjecture of A. Frank.
متن کاملSampling Eulerian orientations of triangular lattice graphs
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian graphs. We analyse the mixing time of a Markov chain on the Eulerian orientations of a planar gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2020
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2019.105183